On b-coloring of cartesian product of graphs
نویسندگان
چکیده
A b-coloring of a graph G by k colors is a proper k-coloring of the vertices of G such that in each color class there exists a vertex having neighbors in all the other k−1 color classes. The b-chromatic number φ(G) of a graph G is the maximum k for which G has a b-coloring by k colors. This concept was introduced by R.W. Irving and D.F. Manlove in 1999. In this paper we study the b-chromatic numbers of the cartesian products of paths and cycles with complete graphs and the cartesian product of two complete graphs.
منابع مشابه
Secret Sharing Based On Cartesian product Of Graphs
The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...
متن کاملOn the b-coloring of cartesian product of graphs
A b-coloring of a graph G by k colors is a proper k-coloring of the vertices of G such that in each color class there exists a vertex having neighbors in all the other k − 1 color classes. The b-chromatic number φ(G) of a graph G is the maximum k for which G has a b-coloring by k colors. This concept was introduced by R.W. Irving and D.F. Manlove in 1999. In this paper we study the b-chromatic ...
متن کاملEquitable Colorings of Cartesian Product Graphs of Wheels with Complete Bipartite Graphs
By the sorting method of vertices, the equitable chromatic number and the equitable chromatic threshold of the Cartesian products of wheels with bipartite graphs are obtained. Key–Words: Cartesian product, Equitable coloring, Equitable chromatic number, Equitable chromatic threshold
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملb-coloring in Square of Cartesian Product of Two Cycles
A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each color class contains a color dominating vertex, that is, a vertex which has at least one neighbor in each of the other color classes. The largest integer k(>0) for which G has a b-coloring using k colors is the b-chromatic number b(G) of G. In this paper, we obtain the b-chromatic number of the square...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 107 شماره
صفحات -
تاریخ انتشار 2012